Some recent problems in storage battery engineering
نویسندگان
چکیده
منابع مشابه
Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts
This talk will discuss some recent results on the complexity theory of quantum computing. The long term goal is to understand exactly the relationship between the new quantum complexity classes and the classic ones. It is assumed that you are not an expert in: quantum flavordynamics, quantum geometrodynamics, quantum hydrodynamics, quantum magnetodynamics, quantum triviality, Schrödinger’s equa...
متن کاملOn Some Epistemological Problems of Software Engineering
The paper addresses some misconceptions of Software Engineering, requirements analysis and modelling in particular, due to underlying epistemological flaws., e.g. the believe that the system analyst's task be simlar to that of a natural scientist's. The fundamental issues, constitution of objects and signs, conceptualization and definability, are discussed. It comes out that the paradoxical sit...
متن کاملRecent Trends in Archaeological Theory: Some Comments
This paper selectively reviews some recent themes in archaeological theory: a philosophical pragmatism, a turn to materiality, and understanding the past in the context of the present. It concludes with some reflective comments on the author’s Archaeological Theory: An Introduction, in advance of the third revised edition.
متن کاملThe Problems of Time and Observables: Some Recent Mathematical Results
Einstein’s theory of gravitation can be viewed as a constrained Hamiltonian system [1]. The constraints are “first class”, which indicates they generate “gauge transformations” on the phase space. In such systems it is important to separate cleanly the “pure gauge” content of the phase space from the “gauge invariant” information. In general relativity this leads, respectively, to the problem o...
متن کاملSome Recent Progress on the Complexity of Lattice Problems
We survey some recent developments in the study of the complexity of lattice problems. After a discussion of some problems on lattices which can be algorithmically solved efficiently, our main focus is the recent progress on complexity results of intractability. We will discuss Ajtai’s worstcase/average-case connections, NP-hardness and non-NPhardness, transference theorems between primal and d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Franklin Institute
سال: 1910
ISSN: 0016-0032
DOI: 10.1016/s0016-0032(10)90731-x